Planning as Satis ability
نویسندگان
چکیده
We develop a formal model of planning based on satis ability rather than deduction The satis ability approach not only provides a more ex ible framework for stating di erent kinds of constraints on plans but also more accurately re ects the theory behind modern constraint based plan ning systems Finally we consider the computational characteristics of the resulting formulas by solving them with two very di erent satis ability
منابع مشابه
Contingent Planning Under Uncertainty via Stochastic Satis ability
We describe two new probabilistic planning techniques|c-maxplan and zander|that generate contingent plans in probabilistic propositional domains. Both operate by transforming the planning problem into a stochastic satis ability problem and solving that problem instead. c-maxplan encodes the problem as an E-Majsat instance, while zander encodes the problem as an S-Sat instance. Although S-Sat pr...
متن کاملRe nement - based Planning As Satis ability
It has been shown recently that planning problems are easier to solve when they are cast as model nding problems. Some schemes for automated generation of the encodings of the planning problems in propositional logic have been designed. However these schemes lack several of the re nements that traditional split & prune type planners do. We show that it is possible to transfer these re nements i...
متن کاملHeuristic Backbone Sampling for Maximum Satis ability
The weighted maximum satis ability (MAXSAT) problem is of great interest to the Arti cial Intelligence community, as a model for several constraint satisfaction problems (emerging e.g. from planning) which require that an optimum subset of their constraints be satis ed. Recent research on satis ability (SAT) problems has reached interesting conclusions regarding their hardness. In this paper, w...
متن کاملMAXPLAN: A New Approach to Probabilistic Planning
Classical arti cial intelligence planning techniques can operate in large domains but traditionally assume a deterministic universe. Operations research planning techniques can operate in probabilistic domains but break when the domains approach realistic sizes. maxplan is a new probabilistic planning technique that aims at combining the best of these two worlds. maxplan converts a planning ins...
متن کاملIncremental SAT Solving for SAT Based Planning
One of the most successful approaches to automated planning is the translation to propositional satis ability (SAT). This thesis evaluates incremental SAT solving for several modern encodings for SAT based planning. Experiments based on benchmarks from the 2014 International Planning Competition show that an incremental approach signi cantly outperforms non-incremental solving. Although, planni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992